Material choices for fibre in the Neolithic: an approach through the measurement of mechanical properties

Studies of the Mesolithic-Neolithic transition in Europe have focused on plants and animals exploited for food. However, the exploitation of plants for fibres underwent a significant change with the addition of domestic flax as a fibre crop. While the technology of flax fibre processing is increasingly understood by archaeologists, its material value as a fibre crop in comparison to indigenous fibre is less well explored. We examine the mechanical properties of flax and two indigenous fibres (lime bast, willow bast), by testing fibre strips for tensile properties and discuss the results in the light of material choices in these periods

Modular Hardware Design with Timeline Types

Modular design is a key challenge for enabling large-scale reuse of hardware modules. Unlike software, however, hardware designs correspond to physical circuits and inherit constraints from them. Timing constraints -- which cycle a signal arrives, when an input is read -- and structural constraints -- how often a multiplier accepts new inputs -- are fundamental to hardware interfaces. Existing hardware design languages do not provide a way to encode these constraints; a user must read documentation, build scripts, or in the worst case, a module's implementation to understand how to use it. We present Filament, a language for modular hardware design that supports the specification and enforcement of timing and structural constraints for statically scheduled pipelines. Filament uses timeline types, which describe the intervals of clock-cycle time when a given signal is available or required. Filament enables safe composition of hardware modules, ensures that the resulting designs are correctly pipelined, and predictably lowers them to efficient hardware.Comment: Extended version of PLDI '23 pape

On-Line Distributed Traffic Grooming

This paper addresses the problem of on-line traffic grooming in WDM paths. Each request consists of a source node, a destination node, and the desired bandwidth for the connection. Connections may be multi-hop, permitting the use of multiple lightpaths. We describe a new distributed on-line algorithm for this problem that is provably wide-sense non-blocking under cer- tain assumptions. Moreover, we use simulations to demonstrate that the algorithm is extremely effective even when some of these assumptions are relaxed